The Tutte polynomial modulo a prime

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Tutte Polynomial Modulo a Prime

For Fp the field on prime number p > 3 elements, it has been conjectured that there are just p+3 evaluations of the Tutte polynomial in Fp which are computable in polynomial time. In this note it is shown that if p 6≡ −1mod 12 then there are further polynomial-time computable evaluations. 1 Definitions and introduction Let G = (V,E) denote a graph, with loops and parallel edges permitted, and G...

متن کامل

On the tutte polynomial of benzenoid chains

The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.

متن کامل

The Tutte polynomial

This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–...

متن کامل

Orders Modulo A Prime

In this article I develop the notion of the order of an element modulo n, and use it to prove the famous n 2 + 1 lemma as well as a generalization to arbitrary cyclotomic polynomials. References used in preparing this article are included in the last page. §1 Introduction I might as well state one of the main results of this article up front, so the following discussion seems a little more moti...

متن کامل

The Tutte Polynomial as a Growth Function

The ‘dollar game’ represents a kind of diffusion process on a graph. Under the rules of the game some configurations are both stable and recurrent, and these are known as critical configurations. The set of critical configurations can be given the structure of an abelian group, and it turns out that the order of the group is the tree-number of the graph. Each critical configuration can be assig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2004

ISSN: 0196-8858

DOI: 10.1016/s0196-8858(03)00084-8